TEMPLATE-DIRECTED BIOPOLYMERIZATION: TAPE-COPYING TURING MACHINES
نویسندگان
چکیده
منابع مشابه
First Passage Time in Computation by Tape-Copying Turing Machines: Slippage of Nascent Tape
Transcription of the genetic message encoded chemically in the sequence of the DNA template is carried out by a molecular machine called RNA polymerase (RNAP). Backward or forward slippage of the nascent RNA with respect to the DNA template strand give rise to a transcript that is, respectively, longer or shorter than the corresponding template. We model a RNAP as a “Tapecopying Turing machine”...
متن کاملNondeterministic One-Tape Off-Line Turing Machines
Finite state control Semi-infinite tape which contains, at the beginning of the computation: the input string, on its part of the tape the blank symbol, in the remaining squares According to the transition function at each step the machine: changes its internal state writes a nonblank symbol on the scanned tape square moves the head either to the left, or to the right, or keeps it on the same s...
متن کاملA formalization of multi-tape Turing machines
We discuss the formalization, in the Matita Theorem Prover, of basic results on multi-tapes Turing machines, up to the existence of a (certified) Universal Machine, and propose it as a natural benchmark for comparing different interactive provers and assessing the state of the art in the mechanization of formal reasoning. The work is meant to be a preliminary step towards the creation of a form...
متن کاملInfinite Time Turing Machines With Only One Tape
Infinite time Turing machines with only one tape are in many respects fully as powerful as their multi-tape cousins. In particular, the two models of machine give rise to the same class of decidable sets, the same degree structure and, at least for functions f .. R → N, the same class of computable functions. Nevertheless, there are infinite time computable functions f : R → R that are not one-...
متن کاملThe Transfinite Action of 1 Tape Turing Machines
• We produce a classification of the pointclasses of sets of reals produced by infinite time turing machines with 1-tape. The reason for choosing this formalism is that it apparently yields a smoother classification of classes defined by algorithms that halt at limit ordinals. • We consider some relations of such classes with other similar notions, such as arithmetical quasi-inductive definitio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biophysical Reviews and Letters
سال: 2012
ISSN: 1793-0480,1793-7035
DOI: 10.1142/s1793048012300083